Metric-Driven Grammars and Morphogenesis
نویسنده
چکیده
Expansion of space, rather than the progress of time, drives many developmental processes in plants. Metric-driven grammars provide a formal method for specifying and simulating such processes. We illustrate their operation using cell division patterns, phyllotactic patterns, and several aspects of leaf development.
منابع مشابه
Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformation
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these grammars may be triggered by user actions (such as creating, editing or connecting elements) and in its turn may trigger other user-interface events. Its combination with (non-monotonic) triple graph grammars allows co...
متن کاملParsing with the Shortest Derivation
Common wisdom has it that the bias of stochastic grammars in favor of shorter derivations of a sentence is harmful and should be redressed. We show that the common wisdom is wrong for stochastic grammars that use elementary trees instead of context-free rules, such as Stochastic Tree-Substitution Grammars used by Data-Oriented Parsing models. For such grammars a non-probabilistic metric based o...
متن کاملHead-driven Parsing for Lexicalist Grammars: Experimental Results
We present evidence that head-driven parsing strategies lead to efficiency gains over standard parsing strategies, for lexicalist, concatenative and unification-based grammars. A head-driven parser applies a rule only after a phrase matching the head has been derived. By instantiating the head of the rule important information is obtained about the left-hand-side and the other elements of the r...
متن کاملThe Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules
In this paper, it is shown that the addition of simple and linguistically motivated forms of lexical rules to grammatical theories based on subcategorization lists, such as categorial grammars (CG) or head-driven phrase structure grammars (HPSG), results in a system that can generate all and only the recursively enumerable languages. The proof of this result is carried out by means of a reducti...
متن کاملInfinite Arrays and Infinite Computations
A complete metric ttipology is introduced on the set of :il finite and infinite arrays and the topological properties of the space are studied. In this complete metric topolor,y, infinite arrays are the limits of increasing sequences of finite arrays. The n.>tion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinif e arrays, is introduced. This c...
متن کامل